Upper bounds on Q-spectral radius of book-free and/or $K_{s,t}$-free graphs
نویسندگان
چکیده
In this paper, two results about the signless Laplacian spectral radius q(G) of a graph G of order n with maximum degree ∆ are proved. Let Bn = K2 + Kn denote a book, i.e., the graph Bn consists of n triangles sharing an edge. The results are the following: (1) Let 1 < k ≤ l < ∆ < n and G be a connected {Bk+1,K2,l+1}-free graph of order n with maximum degree ∆. Then q(G) ≤ 1 4 [ 3∆ + k − 2l + 1 + √ (3∆ + k − 2l + 1)2 + 16l(∆ + n− 1) ] with equality if and only if G is a strongly regular graph with parameters (∆, k, l). (2) Let s ≥ t ≥ 3, and let G be a connected Ks,t-free graph of order n (n ≥ s + t). Then q(G) ≤ n + (s− t + 1)1/tn1−1/t + (t− 1)(n− 1)1−3/t + t− 3.
منابع مشابه
Bounds of spectral radii of K_{2,3}-minor free graphs
Let A(G) be the adjacency matrix of a graph G. The largest eigenvalue of A(G) is called spectral radius of G. In this paper, an upper bound of spectral radii of K2,3-minor free graphs with order n is shown to be 3 2 + √ n− 7 4 . In order to prove this upper bound, a structural characterization of K2,3-minor free graphs is presented in this paper.
متن کاملSharp Bounds on the PI Spectral Radius
In this paper some upper and lower bounds for the greatest eigenvalues of the PI and vertex PI matrices of a graph G are obtained. Those graphs for which these bounds are best possible are characterized.
متن کاملON THE GROUPS WITH THE PARTICULAR NON-COMMUTING GRAPHS
Let $G$ be a non-abelian finite group. In this paper, we prove that $Gamma(G)$ is $K_4$-free if and only if $G cong A times P$, where $A$ is an abelian group, $P$ is a $2$-group and $G/Z(G) cong mathbb{ Z}_2 times mathbb{Z}_2$. Also, we show that $Gamma(G)$ is $K_{1,3}$-free if and only if $G cong {mathbb{S}}_3,~D_8$ or $Q_8$.
متن کاملSome results on the energy of the minimum dominating distance signless Laplacian matrix assigned to graphs
Let G be a simple connected graph. The transmission of any vertex v of a graph G is defined as the sum of distances of a vertex v from all other vertices in a graph G. Then the distance signless Laplacian matrix of G is defined as D^{Q}(G)=D(G)+Tr(G), where D(G) denotes the distance matrix of graphs and Tr(G) is the diagonal matrix of vertex transmissions of G. For a given minimum dominating se...
متن کاملOn Zagreb Energy and edge-Zagreb energy
In this paper, we obtain some upper and lower bounds for the general extended energy of a graph. As an application, we obtain few bounds for the (edge) Zagreb energy of a graph. Also, we deduce a relation between Zagreb energy and edge-Zagreb energy of a graph $G$ with minimum degree $delta ge2$. A lower and upper bound for the spectral radius of the edge-Zagreb matrix is obtained. Finally, we ...
متن کامل